Distribution Property of Recursive Sequences Defined

نویسنده

  • KENJI NAGASAKA
چکیده

We shall consider a distribution property of sequences of integers. Let us denote a (a„)nGM an infinite sequence of integers. For integers N > 1, m > 2, and j (0 < J < 77Z — 1), let us define AN(j9 m9 a) as the number of terms among al3 a2S ...9aN satisfying the congruence an = j (mod m) . A sequence a (an)nEH±s said to be uniformly distributed modulo m (u.d. mod m) if, for every J = 0, 1, ...,772-1, AN(j9 m9 a) 1 lim = -. (1.1) iu^co N m A sequence a = ( a n ) n € N is said to be uniformly distributed in Z if, for any integer m > 2, a = ( a n ) n e ^ is uniformly distributed modulo 777. This notion was first introduced by Niven [6] and various results are already obtained (see Kuipers & Niederreiters book [4]), among which the sequence of Fibonacci numbers and its generalizations were investigated with respect to uniform distribution property modulo 777. The sequence of generalized Fibonacci numbers is defined by the following linear recurrence formula of second order,

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Limit distribution of the degrees in scaled attachment random recursive trees

We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...

متن کامل

On the first variable Zagreb index

‎The first variable Zagreb index of graph $G$ is defined as‎ ‎begin{eqnarray*}‎ ‎M_{1,lambda}(G)=sum_{vin V(G)}d(v)^{2lambda}‎, ‎end{eqnarray*}‎ ‎where $lambda$ is a real number and $d(v)$ is the degree of‎ ‎vertex $v$‎. ‎In this paper‎, ‎some upper and lower bounds for the distribution function and expected value of this index in random increasing trees (rec...

متن کامل

The eccentric connectivity index of bucket recursive trees

If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.

متن کامل

AIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems

The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...

متن کامل

Stochastically Recursive Sequences and Their Generalizations

The paper deals with the stochastically recursive sequences { X (n) } defined as the solutions of equations X (n + 1) = f (X (n) , ξ n) (where ξ n is a given random sequence), and with random sequences of a more general nature, named recursive chains. For those the theorems of existence, ergodicity, stability are established, the stationary majorants are constructed. Continuous-time processes a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1982